Modeling managerial search behavior based on Simon’s concept of satisficing
نویسندگان
چکیده
Abstract Computational models of managerial search often build on backward-looking based hill-climbing algorithms. Regardless its prevalence, there is some evidence that this family algorithms does not universally represent managers’ behavior. Against background, the paper proposes an alternative algorithm captures key elements Simon’s concept satisficing which received considerable support in behavioral experiments. The contrasts satisficing-based to two variants agent-based model a simple decision-making organization. builds framework NK fitness landscapes allows controlling for complexity decision problem be solved. results suggest model’s behavior may remarkably differ depending whether or serves as algorithmic representation decision-makers’ search. Moreover, with algorithm, indicate oscillating aspiration levels, even negative, and intense—and potentially destabilizing—search activities when intra-organizational increases. Findings shed new light prior computational organizations point avenues future research.
منابع مشابه
Satisficing Anytime Action Search for Behavior-Based Voting
Within the field of behavior-based robotics, a useful and popular technique for robot control is that of utilitarian voting, where behaviors representing objectives assign utilities to candidate actions. Utilitarian voting allows for distributed, modular control but is not well suited to systems with very high resolution or several, dependent degrees of freedom. Past systems have depended on ex...
متن کاملCost Based Satisficing Search Considered Harmful
Recently, several researchers have found that cost-based satisficing search with A* often runs into problems. Although some ”work arounds” have been proposed to ameliorate the problem, there has not been any concerted effort to pinpoint its origin. In this paper, we argue that the origins can be traced back to the wide variance in action costs that is observed in most planning domains. We show ...
متن کاملA Wrinkle on Satisficing Search Problems
The problem of optimally ordering the execution of independent disjuncts is explored. Only a single answer is sought, not necessarily the best one. By definition, this is called satisfying search. Since the disjuncts are independent, the total combined probability that a solution is found does not depend on the execution order. However, the ordering does affect the total expected execution time...
متن کاملthe influence of the neo-platonic concept of poetic imagination on wordsworth’s poetry
بر اساس نظریه افلاطون در باره شعر خلاقیت هنری مورد انتقاد قرار گرفته است. نظریه کلی در مورد شعر این بود که شعر از ظواهرتقلید میکند و نه حقیقت. چون سایه ای از حقیقت است. اما با پیدایش فلسفه نو افلاطونی، انتقاتات قبلی در مورد شعر و شاعری اصلاح شد. فلوطین در کتاب انئید، اساس خلق هنری را بر محور مُثل افلاطونی قرار داد. وی باور داشت که هنر مندان در خلق آثار هنری، تحت تاثیر مُثل افلاطونی بوده و عوالمی ...
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Mathematical Organization Theory
سال: 2021
ISSN: ['1381-298X', '1572-9346']
DOI: https://doi.org/10.1007/s10588-021-09344-x